A local greedy algorithm and higher-order extensions for global numerical continuation of analytically varying subspaces
نویسنده
چکیده
We present a family of numerical implementations of Kato’s ODE propagating global bases of analytically varying invariant subspaces, of which the first-order version is a surprising simple “greedy algorithm” that is both stable and easy to program and the second-order version a relaxation of a first-order scheme of Brin and Zumbrun. The method has application to numerical Evans function computations used to assess stability of traveling-wave solutions of time-evolutionary PDE.
منابع مشابه
A local greedy algorithm for global numerical continuation of analytically varying subspaces
We give a simplified version of Kato’s ODE propagating global bases of analytically varying invariant subspaces, whose numerical implementation as a first-order Euler scheme leads to a surprising simple “greedy algorithm” that is both stable and easy to program. The method has application to numerical Evans function computations used to assess stability of traveling-wave solutions of time-evolu...
متن کاملEfficient Computation of Analytic Bases in Evans Function Analysis of Large Systems
In Evans function computations of the spectra of asymptotically constant-coefficient linearized operators of large systems, a problem that becomes important is the efficient computation of global analytically varying bases for invariant subspaces of the limiting coefficient matrices. In the case that the invariant subspace is spectrally separated from its complementary invariant subspace, we pr...
متن کاملA Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics
One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...
متن کاملA Novel Method for Content Base Image Retrieval Using Combination of Local and Global Features
Content-based image retrieval (CBIR) has been an active research topic in the last decade. In this paper we proposed an image retrieval method using global and local features. Firstly, for local features extraction, SURF algorithm produces a set of interest points for each image and a set of 64-dimensional descriptors for each interest points and then to use Bag of Visual Words model, a cluster...
متن کاملA Novel Method for Content Base Image Retrieval Using Combination of Local and Global Features
Content-based image retrieval (CBIR) has been an active research topic in the last decade. In this paper we proposed an image retrieval method using global and local features. Firstly, for local features extraction, SURF algorithm produces a set of interest points for each image and a set of 64-dimensional descriptors for each interest points and then to use Bag of Visual Words model, a cluster...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008